Capacity of Dynamical Storage Systems

We introduce a dynamical model of node repair in distributed storage systems wherein the nodes are subjected to failures according independent Poisson processes. The main parameter that we study is time-average capacity network scenario where fixed subset support higher bandwidth than other nodes. sequence generates random permutations encoded block, and state as Markov walk on n elements. As our result show can be increased compared static (worst-case) system, while maintaining same (average) bandwidth, derive estimates increase. also quantify increase case center has information about recently failed